Distributed Mean Field Genetic Algorithm for Channel Routing
نویسندگان
چکیده
منابع مشابه
Extended Distributed Genetic Algorithm for Channel Routing
In this paper, we propose a new parallel genetic a lge rithm (GA), called Extended Distributed Genetic Algorithm (EDGA), for channel routing problem. The EDGA combines the advantages of previous parallel GA models , viz., master/slave GA model and distributed GA model. In EDGA, the root processor executes the conventional genetic algorithm with global selection on total population and the remai...
متن کاملParallel genetic algorithm for channel routing
In this paper, we propose a new channel routing algorithm based on genetic approach. This involves designing a new encoding scheme and an evaluation function used by the genetic algorithm(GA) for channel routing problem. The algorithm has been implemented as both sequential and distributed CA. The speedup achieved is positive and encouraging.
متن کاملGenetic Algorithm for Restrictive Channel Routing Problem
This paper presents a genetic algorithm for the restrictive channel routing problem. The major difference of the algorithm from already known genetic algorithms for this problem consists of the use of information about horizontal and vertical constraints in chromosome encoding that allow prevention of “illegal” solutions. This representation leads to lower complexity, because solution repairing...
متن کاملA Genetic Algorithm for Channel Routing using Inter-Cluster Mutation
In this paper, we propose an algorithm for the channel routing problem based on genetic approach that uses a new type of mutation, called inter-cluster mutation . The performance of genetic algorithmbased channel router is improved by incorporating problem-specific knowledge into the inter-cluster mutation operators. A solution of the channel routing problem is represented by horizontal non-con...
متن کاملA Genetic Algorithm for Channel Routing in VLSI Circuits
A new genetic algoriihm for channel routing in $he physical design process of L'LSI circtiis i5 prestsfed. The algorithm is bused on a problem specific represen-iadion scheme and problem speciJc genetic operators. The geneiic encoding and our genelic operators are descrabed in defoii. The performance of.the algoriihnt is tested on difleerrnl benchmarks and it is shown that the results obdained ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of the Korean Institute of Information and Communication Engineering
سال: 2010
ISSN: 2234-4772
DOI: 10.6109/jkiice.2010.14.2.287